02/08/2025
Recently, I happened upon the following MathOverflow
thread about the "best" proofs of the quadratic reciprocity law. One
particular answer caught
my eye, which explains how the usual Gauss sum proof, say as given in
Serre’s Cours d’arithmétique, falls out of the Galois theory of
and
,
where
are the odd primes in
question. In fact, the resulting proof is not only highly conceptual,
but it is also offers a "plausible" path by which one could discover
quadratic reciprocity! The goal of this post is to give a leisurely
account of the proof in this spirit.
Let be an odd prime. We want to start by
understanding why a (different) odd prime
being a square modulo
should have anything to due to squares
modulo
, let alone whether
is a square modulo
. The answer lies in the isomorphism
. For starters, the square classes are the index 2
subgroup of
, so Galois theory tells us the corresponding
automorphisms of
over
should fix a
quadratic subfield
, for some square-free integer
. Then, since
is a unit modulo
, whether or not the automorphism
fixes
tells us if
is a square modulo
. Concretely, this automorphism sends
to
. Stepping back, it is not hard to see that such
an element
should exists without
using Galois theory. If
is any element of
, then the automorphism
sends it to
. So if
is a square, we want
and if not we want
, but this is accomplished simply by using
.
And voilà, the quadratic Gauss sum appears! The action of the Galois
group on
implies that it is
equal to
for some
and that
. In fact, since by construction
and
is integrally
closed, we must have
. This means
by our assumption that
is square-free. We have
, with
.
Now we can connect things to squares modulo via the obvious isomorphisms
depends on
in the following way: if
is 0 modulo
, then
is the dual numbers over
. If
is a non-zero square,
then since
is odd
has two
distinct roots in
, so
,
and if
is not a square,
. But all of these rings can be distinguished from
one another by the Frobenius endomorphism, which is nothing but the
Galois action
on
modulo
. Precisely, letting
, we have that the images of
and
coincide in
. Assuming that
does not divide
, and letting
,
denote the respective images of
in
, the Frobenius endomorphism on
is either the identity, so in
particular fixes
, or it
sends
to
. Our
characterisation of
shows that
, but we have just noted that
hence
.
Now, we need only compute
(and hope it gives us a nice answer!). To this end, it will be useful to
fix
as the complex
number
, then
is just the the
Fourier transform
(with respect to the group
) of
the Legendre symbol, evaluated at the character
. For
coprime to
, and
,
defined by
,
, as this is just a conjugate of
under
.
evaluated at the trivial character is
0, since there is an equal amount of non-zero squares and non-squares
modulo
. A useful property of the Fourier
transform is the Plancherel formula, that is
. In the case of
, this
is expressed as
since the dual measure on
with respect to the counting measure on
is
the normalised counting measure. If
is the Legendre symbol, the formula
gives
, i.e.
. Great!
We now know that our assumption that
is coprime to
was valid, and so we can use the
formula
, so we need only work out the sign. To do this,
we just need to look at how
behaves under complex
conjugation, since the sign of
corresponds to
being real or
imaginary. In
,
complex conjugation restricts to the automorphism defined by
, so the complex conjugate of
is
. We thus conclude that
. A quick
computation with Legendre symbols then yields
or in its more traditional form
QED